A Recent Survey on Incremental Temporal Association Rule Mining

88 Abstract— One of the most challenging areas in data mining is Association rule mining. Several algorithms have been developed to solve this problem. These algorithms work efficiently with static datasets. But if new records are added time to time to the datasets means if the datasets are incremental in nature, scenario of association rules may changed. Some of the new itemsets may become frequent, while some previously derived frequent set may become infrequent. Due to updated dataset some rules that are already derived may dropped and some new rules may arrive up. For the up to-date rules over the updated dataset, if the association mining technique redo the rule generation process for the whole dataset, based on the frequent itemsets, simply by discarding the earlier computed results, it will inefficient. It is mostly due to the multiple scanning over the older dataset. Recently, temporal data mining has become a core technical data processing technique to deal with changing data. Actually, temporal databases are continually appended or updated so that the discovered rules need to be updated. In this paper we represent the survey of various methods for incremental as well as temporal association rule mining.